Waiting for Locks: How Long Does It Usually Take?
نویسندگان
چکیده
Reliability of low-level operating-system (OS) code is an indispensable requirement. This includes functional properties from the safety-liveness spectrum, but also quantitative properties stating, e.g., that the average waiting time on locks is sufficiently small or that the energy requirement of a certain system call is below a given threshold with a high probability. This paper reports on our experiences made in a running project where the goal is to apply probabilistic model checking techniques and to align the results of the model checker with measurements to predict quantitative properties of low-level OS code.
منابع مشابه
Long Waiting Times for Elective Hospital Care – Breaking the Vicious Circle by Abandoning Prioritisation
Background Policies assigning low-priority patients treatment delays for care, in order to make room for patients of higher priority arriving later, are common in secondary healthcare services today. Alternatively, each new patient could be granted the first available appointment. We aimed to investigate whether prioritisation can be part of the reason why waiting times for care are often...
متن کاملFair Synchronization
Most published concurrent data structures which avoid locking do not provide any fairness guarantees. That is, they allow processes to access a data structure and complete their operations arbitrarily many times before some other trying process can complete a single operation. Such a behavior can be prevented by enforcing fairness. However, fairness requires waiting or helping. Helping techniqu...
متن کاملScalable Reader-Writer Synchronization for Shared-Memory Multiprocessors
Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value. On uniprocessors, mutual exclusion and readerwriter locks are typically designed to de-schedule blocked processes; however, on shared-memory multiprocessors it is often advantageous to have processes busy wa...
متن کاملExtending Hardware Transactional Memory to Support Non-busy Waiting and Non-transactional Actions
Transactional Memory (TM) is a compelling alternative to locks as a general-purpose concurrency control mechanism, but it is yet unclear whether TM should be implemented as a software or hardware construct. While hardware approaches offer higher performance and can be used in conjunction with legacy languages/code, software approaches are more flexible and currently offer more functionality. In...
متن کاملHow long does an HIV test take?
Waiting for test results can certainly be stressful ? and while the past few decades of research on human immunodeficiency virus (HIV) and acquired immune deficiency syndrome (AIDS) have made many advances in testing technology, it's tough to give an exact estimate of how long it takes to get test results. There are many factors to consider, including: how long someone has waited to get tested ...
متن کامل